基于深度学习的秀丽隐杆线虫显微图像分割方法

利用计算机实现自动、准确的秀丽隐杆线虫(C.elegans)的各项形态学参数分析,至关重要的是从显微图像上分割出线虫体态,但由于显微镜下的图像噪声较多,线虫边缘像素与周围环境相似,而且线虫的体态具有鞭毛和其他附着物需要分离,多方面因素导致设计一个鲁棒性的C.elegans分割算法仍然面临着挑战。针对这些问题,提出了一种基于深度学习的线虫分割方法,通过训练掩模区域卷积神经网络(Mask R-CNN)学习线虫形态特征实现自动分割。首先,通过改进多级特征池化将高级语义特征与低级边缘特征融合,结合大幅度软最大损失(LMSL)损失算法改进损失计算;然后,改进非极大值抑制;最后,引入全连接融合分支等方法对分割结果进行进一步优化。实验结果表明,相比原始的Mask R-CNN,该方法平均精确率(AP)提升了4.3个百分点,平均交并比(mIOU)提升了4个百分点。表明所提出的深度学习分割方法能够有效提高分割准确率,在显微图像中更加精确地分割出线虫体。     

A new reverse reduce-error ensemble pruning algorithm

Although greedy algorithms possess high efficiency, they often receive suboptimal solutions of the ensemble pruning problem, since their exploration areas are limited in large extent. And another marked defect of almost all the currently existing ensemble pruning algorithms, including greedy ones, consists in: they simply abandon all of the classifiers which fail in the competition of ensemble selection, causing a considerable waste of useful resources and information. Inspired by these observations, an interesting greedy Reverse Reduce-Error (RRE) pruning algorithm incorporated with the operation of subtraction is proposed in this work. The RRE algorithm makes the best of the defeated candidate networks in a way that, the Worst Single Model (WSM) is chosen, and then, its votes are subtracted from the votes made by those selected components within the pruned ensemble. The reason is because, for most cases, the WSM might make mistakes in its estimation for the test samples. And, different from the classical RE, the near-optimal solution is produced based on the pruned error of all the available sequential subensembles. Besides, the backfitting step of RE algorithm is replaced with the selection step of a WSM in RRE. Moreover, the problem of ties might be solved more naturally with RRE. Finally, soft voting approach is employed in the testing to RRE algorithm. The performances of RE and RRE algorithms, and two baseline methods, i.e., the method which selects the Best Single Model (BSM) in the initial ensemble, and the method which retains all member networks of the initial ensemble (ALL), are evaluated on seven benchmark classification tasks under different initial ensemble setups. The results of the empirical investigation show the superiority of RRE over the other three ensemble pruning algorithms.     

Evolutionary collective behavior decomposition model for time series data mining

In this research, we propose a novel framework referred to as collective game behavior decomposition where complex collective behavior is assumed to be generated by aggregation of several groups of agents following different strategies and complexity emerges from collaboration and competition of individuals. The strategy of an agent is modeled by certain simple game theory models with limited information. Genetic algorithms are used to obtain the optimal collective behavior decomposition based on history data. The trained model can be used for collective behavior prediction. For modeling individual behavior, two simple games, the minority game and mixed game are investigated in experiments on the real-world stock prices and foreign-exchange rate. Experimental results are presented to show the effectiveness of the new proposed model.     

Fault handling in large water networks with online dictionary learning

Fault detection and isolation in water distribution networks is an active topic due to the nonlinearities of flow propagation and recent increases in data availability due to sensor deployment. Here, we propose an efficient two-step data driven alternative: first, we perform sensor placement taking the network topology into account; second, we use incoming sensor data to build a network model through online dictionary learning. Online learning is fast and allows tackling large networks as it processes small batches of signals at a time. This brings the benefit of continuous integration of new data into the existing network model, either in the beginning for training or in production when new data samples are gathered. The proposed algorithms show good performance in our simulations on both small and large-scale networks.     

面部运动单元检测研究综述

面部运动单元检测旨在让计算机从给定的人脸图像或视频中自动检测需要关注的运动单元目标。经过二十多年的研究，尤其是近年来越来越多的面部运动单元数据库的建立和深度学习的兴起，面部运动单元检测技术发展迅速。首先，阐述了面部运动单元的基本概念，介绍了已有的常用面部运动单元检测数据库，概括了包括预处理、特征提取、分类器学习等步骤在内的传统检测方法；然后针对区域学习、面部运动单元关联学习、弱监督学习等几个关键研究方向进行了系统性的回顾梳理与分析；最后讨论了目前面部运动单元检测研究存在的不足以及未来潜在的发展方向。     

Collective reflection strategy for moderating conformity tendency and promoting reflective judgment performance

Reflective judgement is crucial for medical-related practitioners in dealing with controversial issues. However, the conformity phenomenon is likely to occur and interfere with reflective judgement learning during interactive activities. Effective strategies are required to moderate the conformity behaviour tendency (CBT) and improve reflective judgement performance (RJP). This study demonstrates two significant results: (a) Compared with the guided self-reflection learning strategy, the online collective reflection (OCR) learning strategy effectively weakened the learners' general CBT while dealing with professional controversial issues; and (b) a significantly negative correlation between the RJP achieved and the change of CBT in online environment was detected in the OCR group. The implications and potential applications in higher education were discussed. Further studies are needed to confirm the long-term effects and the extending application to other professional studies.     

The effectiveness of adaptive versus non-adaptive learning with digital educational games

For the training of academic skills, digital educational games with integrated adaptivity are promising. Adaptive games are considered superior to non-adaptive games, because they constantly assess children's performance, and accordingly adapt the difficulty of the tasks corresponding to the children's individual level. However, empirical evidence with regard to the effectivity of adaptive compared to non-adaptive games is limited. A study was conducted with 191 children from the third year of Kinder garten who were enrolled in one of three conditions, that is, playing an adaptive version of the reading game (RG), a non-adaptive version of the RG or training with pen-and-paper exercises. In all three conditions, children trained emergent reading (phonological awareness and letter knowledge) once a week for 30 min over a period of 5 weeks. Children's performance on cognitive (phonological awareness, letter knowledge, reading fluency) and non-cognitive (motivation, self-concept) factors was assessed. Results revealed a significant improvement in phonological awareness and letter knowledge in all conditions. However, no differences between the conditions were observed with respect to children's improvement on phonological awareness and letter knowledge or on their post-test scores for reading fluency. With regard to motivation and self-concept, again, no differences in these non-cognitive factors were observed across conditions.     

Complexities of digital technology use and the teaching and learning of function

Many argue that digital technologies have the potential to enhance the teaching and learning of mathematics. However, the availability of technology is not sufficient to realise this potential. The study reported takes a detailed approach to investigate the utility of the particular offerings of the available technologies in the teaching and learning of a specific area of mathematics, functions. Sixteen affordances identified in the data are described. The complexity of the process involved in resolving a situation where particular affordances would be useful so as they are perceived and enacted is detailed. Finally, a grounded theory framework arising from the data analysis from this study that can be used to explain, predict and guide action in other digital environments is presented.     

Adaptive backstepping repetitive learning control design for nonlinear discrete‐time systems with periodic uncertainties

This paper addresses a tracking problem for uncertain nonlinear discrete‐time systems in which the uncertainties, including parametric uncertainty and external disturbance, are periodic with known periodicity. Repetitive learning control (RLC) is an effective tool to deal with periodic unknown components. By using the backstepping procedures, an adaptive RLC law with periodic parameter estimation is designed. The overparameterization problem is overcome by postponing the parameter estimation to the last backstepping step, which could not be easily solved in robust adaptive control. It is shown that the proposed adaptive RLC law without overparameterization can guarantee the perfect tracking and boundedness of the states of the whole closed‐loop systems in presence of periodic uncertainties. In addition, the effectiveness of the developed controller is demonstrated by an implementation example on a single‐link flexible‐joint robot. Copyright © 2014 John Wiley & Sons, Ltd.